4.1 Edge Disjoint Paths
نویسندگان
چکیده
Problem Statement: Given a directed graphG and a set of terminal pairs {(s1, t1), (s2, t2), · · · , (sk, tk)}, our goal is to connect as many pairs as possible using non edge intersecting paths. Edge disjoint paths problem is NP-Complete and is closely related to the multicommodity flow problem. In fact integer multicommodity flow is a generalization of this problem. We describe a greedy approximation algorithm for the edge disjoint path problem due to Jon Kleinberg [4].
منابع مشابه
Efficient algorithms for minimal disjoint path problems on chordal graphs
Disjoint paths have applications in establishing bottleneck-free communication between processors in a network. The problem of finding minimum delay disjoint paths in a network directly reduces to the problem of finding the minimal disjoint paths in the graph which models the network. Previous results for this problem on chordal graphs were an O(| V | | E |) algorithm for 2 edge disjoint paths ...
متن کاملMaximum Edge Disjoint Paths and Minimum Unweighted Multicuts in Grid Graphs
In this paper, we solve in polynomial time the maximum edge disjoint paths problem and the related minimum unweighted multicut problem in grid graphs. Let G = (V,E) be an undirected rectilinear grid and let L be a list of K pairs (source sk, sink tk) of terminal vertices of G. Each pair (sk, tk) defines a net. We assume that sources are on the upper horizontal line, sinks are on the lower horiz...
متن کاملEdge-disjoint Hamiltonian Paths and Cycles in Tournaments
We describe sufficient conditions for the existence of Hamiltonian paths in oriented graphs and use these to provide a complete description of the tournaments with no two edge-disjoint Hamiltonian paths. We prove that tournaments with small irregularity have many edge-disjoint Hamiltonian cycles in support of Kelly's conjecture.
متن کاملFinding Disjoint Paths on Edge-Colored Graphs: More Tractability Results
The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph (MaxCDP) has been recently introduced in literature, motivated by applications in social network analysis. In this paper we investigate how the complexity of the problem depends on graph parameters (distance from disjoint paths and size of vertex cover), and that is not FPT-approximable. Moreov...
متن کاملOn Fixed-Parameter Tractability of Some Routing Problems
Disjoint Paths is the problem of finding paths between given pairs of terminals in a graph such that no vertices are shared between paths. We analyze fixed-parameter tractability of several new Disjoint Paths-like routing problems motivated by congestion control in computer networks. In one model we are interested in finding paths between k pairs of terminals such that the first edge of each pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007